Tree-based Convolution: A New Neural Architecture for Sentence Modeling

نویسندگان

  • Lili Mou
  • Hao Peng
  • Ge Li
  • Yan Xu
  • Lu Zhang
  • Zhi Jin
چکیده

This paper proposes a new convolutional neural architecture based on treestructures, called the tree-based convolutional neural network (TBCNN). Two variants take advantage of constituency trees and dependency trees, respectively, to model sentences. Compared with traditional “flat” convolutional neural networks (CNNs), TBCNNs explore explicitly sentences’ structural information; compared with recursive neural networks, TBCNNs have shorter propagation paths, enabling more effective feature learning and extraction. We evaluated our model in two widely applied benchmarks—sentiment analysis and question classification. Our models outperformed most state-of-the-art results, including both existing neural networks and dedicated feature/rule engineering.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discriminative Neural Sentence Modeling by Tree-Based Convolution

This paper proposes a tree-based convolutional neural network (TBCNN) for discriminative sentence modeling. Our model leverages either constituency trees or dependency trees of sentences. The tree-based convolution process extracts sentences structural features, which are then aggregated by max pooling. Such architecture allows short propagation paths between the output layer and underlying fea...

متن کامل

Convolutional Neural Network for Paraphrase Identification

We present a new deep learning architecture Bi-CNN-MI for paraphrase identification (PI). Based on the insight that PI requires comparing two sentences on multiple levels of granularity, we learn multigranular sentence representations using convolutional neural network (CNN) and model interaction features at each level. These features are then the input to a logistic classifier for PI. All para...

متن کامل

Natural Language Inference by Tree-Based Convolution and Heuristic Matching

In this paper, we propose the TBCNNpair model to recognize entailment and contradiction between two sentences. In our model, a tree-based convolutional neural network (TBCNN) captures sentencelevel semantics; then heuristic matching layers like concatenation, element-wise product/difference combine the information in individual sentences. Experimental results show that our model outperforms exi...

متن کامل

Recognizing Entailment and Contradiction by Tree-based Convolution

In this paper, we propose the TBCNNpair model to recognize entailment and contradiction between two sentences. In our model, a tree-based convolutional neural network (TBCNN) captures sentencelevel semantics; then heuristic matching layers like concatenation, element-wise product/difference combine the information in individual sentences. Experimental results show that our model outperforms exi...

متن کامل

Multichannel Variable-Size Convolution for Sentence Classification

We propose MVCNN, a convolution neural network (CNN) architecture for sentence classification. It (i) combines diverse versions of pretrained word embeddings and (ii) extracts features of multigranular phrases with variable-size convolution filters. We also show that pretraining MVCNN is critical for good performance. MVCNN achieves state-of-the-art performance on four tasks: on small-scale bin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1504.01106  شماره 

صفحات  -

تاریخ انتشار 2015